Tests for unique decipherability

نویسنده

  • Shimon Even
چکیده

less, for any burst of length 11 or less induces at most a burst of length 3 or less and one of length 8 or less in the respective classes of digit positions. Some codes obtained along the same lines are listed in Table II, where (b,, bz) and (n, + n,) mean that the code is a combination of a burst-b, code with code-length n, and a burst-b, code with code-length n 2, each of which is generated by a polynomial in the first row of Table I. For any b > 20, it is easy to find a composite shortened cyclic burst-b code with the minimum number of checkdigits such that n/r is nearly equal to 3. The efficiency of group codes for burst-error correction might be measured in terms of the theoretical maximum code length n, defined by9

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiset and Set Decipherable Codes

we extend some results of Lempel and Restive on multiset decipherable codes to set decipherable codes. @ 2001 Elsevier Science Ltd. All rights reserved. Keywords-Codes, Unique decipherability, Multiset decipherability, Dominoes, Set decipherability.

متن کامل

Decidability of multiset, set and numerically decipherable directed figure codes

Codes with various kinds of decipherability, weaker than the usual unique decipherability, have been studied since multiset decipherability was introduced in mid-1980s. We consider decipherability of directed figure codes, where directed figures are defined as labelled polyominoes with designated start and end points, equipped with catenation operation that may use a merging function to resolve...

متن کامل

Coding Partitions

Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD), we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the “unique decipherability” at the level of the classes of the partition. By tacking into account the natural order between the partitions, we define the c...

متن کامل

Code Problems on Traces

The topic of codes in the framework of trace monoids leads to interesting and challenging decision problems of combinatorial avour. We give an overview of the current state of some basic questions in this eld. Among these, we consider the existence problem for strong cod-ings, clique-preserving morphisms and the unique decipherability problem (code problem).

متن کامل

Note on Decipherability of Three-word Codes

The theory of uniquely decipherable (UD) codes has been widely developed in connection with automata theory, combinatorics on words, formal languages, and monoid theory. Recently, the concepts ofmultiset decipherable (MSD) and set decipherable (SD) codes were developed to handle some special problems in the transmission of information. Unique decipherability is a vital requirement in a wide ran...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 9  شماره 

صفحات  -

تاریخ انتشار 1963